On the parity-check matrix of generalized concatenated code
نویسندگان
چکیده
منابع مشابه
A fast low-density parity-check code simulator based on compressed parity-check matrices
Low-density parity-check (LDPC) codes are very powerful error-correction codes with capabilities approaching the Shannon’s limits. In evaluating the error performance of a LDPC code, the computer simulation time taken becomes a primary concern when tens of millions of noise-corrupted codewords are to be decoded, particularly for codes with very long lengths. In this paper, we propose modeling t...
متن کاملDistributed decoding of rectangular parity-check code
Introduction: The goal of this Letter is to investigate the possibility of achieving spatial diversity without the use of physically connected antenna arrays by examining the simple case of a two-node network. We consider a pair of nodes that are connected via a communication channel that has relatively benign characteristics. Typically, these two nodes are in close proximity. For simplicity, w...
متن کاملParallel and Serial Concatenated Single Parity Check Product Codes
The parallel and serial concatenation of codes is well established as a practical means of achieving excellent performance. In this paper, we introduce the parallel and serial concatenation of single parity check (SPC) product codes. The weight distribution of these codes is analyzed and the performance is bounded. Simulation results confirm these bounds at high signal-to-noise ratios. The perf...
متن کاملCode-Based Cryptosystems Using Generalized Concatenated Codes
Public-key cryptosystems nowadays are mostly based on number theoretic problems like factorization (RSA) and the discrete logarithm problem (Elgamal). However, such systems can be broken with quantum computers by applying Shor’s algorithms [1] for solving both problems, factorization and discrete logarithm, in polynomial time. Hence there is a need for post-quantum cryptography, i.e., methods r...
متن کاملParity Check Matrix Recognition from Noisy Codewords
We study recovering parity check relations for an unknown code from intercepted bitstream received from Binary Symmetric Channel in this paper. An iterative column elimination algorithm is introduced which attempts to eliminate parity bits in codewords of noisy data. This algorithm is very practical due to low complexity and use of XOR operator. Since, the computational complexity is low, searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2019
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-019-9871-y